Recursive filtering for splines on hexagonal lattices

نویسندگان

  • Dimitri Van De Ville
  • Thierry Blu
  • Michael Unser
چکیده

Hex-splines are a novel family of bivariate splines, which are well suited to handle hexagonally sampled data. Similar to classical 1D B-splines, the spline coefficients need to be computed by a prefilter. Unfortunately, the elegant implementation of this prefilter by causal and anti-causal recursive filtering is not applicable for the (non-separable) hex-splines. Therefore, in this paper we introduce a novel approach from the viewpoint of approximation theory. We propose three different recursive filters and optimize their parameters such that a desired order of approximation is obtained. The results for third and fourth order hex-splines are discussed. Although the proposed solutions provide only quasi-interpolation, they tend to be very close to the interpolation prefilter.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Image resampling between orthogonal and hexagonal lattices

Resampling techniques are commonly required in digital image processing systems. Many times the classical interpolation functions are used, i.e., nearest-neighbour interpolation and bilinear interpolation, which are prone to the introduction of undesirable artifacts due to aliasing such as moire patterns. This paper presents a novel approach which minimizes the loss of information, in a least-s...

متن کامل

Computation of interpolatory splines via triadic subdivision

We present an algorithm for computation of interpolatory splines of arbitrary order at triadic rational points. The algorithm is based on triadic subdivision of splines. Explicit expressions for the subdivision symbols are established. These are rational functions. The computations are implemented by recursive filtering.

متن کامل

Periodic and Recursive Control Theoretic Smoothing Splines

In this paper a recursive control theoretic smoothing spline approach is proposed for reconstructing a closed contour. Periodic splines are generated through minimizing a cost function subject to constraints imposed by a linear control system. The optimal control problem is shown to be proper and sufficient optimality conditions are derived for a special case of the problem using Hamilton-Jacob...

متن کامل

Contour reconstruction using recursive smoothing splines - Algorithms and experimental validation

In this paper, a recursive smoothing spline approach for contour reconstruction is studied and evaluated. Periodic smoothing splines are used by a robot to approximate the contour of encountered obstacles in the environment. The splines are generated through minimizing a cost function subject to constraints imposed by a linear control system and accuracy is improved iteratively using a recursiv...

متن کامل

Efficient volume rendering on the body centered cubic lattice using box splines

We demonstrate that non-separable box splines deployed on body centered cubic lattices (BCC) are suitable for fast evaluation on present graphics hardware. Therefore, we develop the linear and quintic box splines using a piecewise polynomial (pp)-form as opposed to their currently known basis (B)-form. The pp-form lends itself to efficient evaluation methods such as de Boor’s algorithm for spli...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003